An arithmetical hierarchy in propositional dynamic logic
نویسندگان
چکیده
منابع مشابه
An Arithmetical Hierarchy in Propositional Dynamic Logic
Propositional dynamic logic (PDL), as introduced by Fischer and Ladner (1979) is the propositional part of the dynamic logic of Pratt (1976). Our aim in this paper is to answer a basic question: Does every alternation of modalities add to the expressive power of the logic? We give a positive answer to the question by building models where modalities behave (somewhat) like quantifiers in first-o...
متن کاملThe Logic of Arithmetical Hierarchy
Dzhaparidze, G., The logic of arithmetical hierarchy, Annals of Pure and Applied Logic 66 (1994) 89-112. Formulas of the propositional modal language with the unary modal operators 0, H,, B,, Zz, I!!,, are considered as schemata of sentences of arithmetic (PA), where q A is interpreted as (a formalization of) “A is PA-provable”, X,,A as “A is PA-equivalent to a &-sentence” and &,A as “A is PA-e...
متن کاملFuzzy Logic and Arithmetical Hierarchy III
Fuzzy logic is understood as a logic with a comparative and truth-functional notion of truth. Arithmetical complexity of sets of tautologies (identically true sentences) and satissable sentences (sentences true in at least one interpretation) as well of sets of provable formulas of the most important systems of fuzzy predicate logic is determined or at least estimated .
متن کاملGeneralizing Propositional Dynamic Logic
A new semantics of Propositional Dynamic Logic (PDL) is given in terms of predicate transformers: Instead of associating the standard state transformer with each program, we model programs by operations on sets of states, operations which map postconditions to weakest liberal preconditions. This yields a logic more general than PDL since new program operations such as angelic choice become expr...
متن کاملPropositional Dynamic Logic of Flowcharts
Following a suggestion of Pratt, we consider propositional dynamic logic in which programs are nondeterministic finite automata o~¢er atomic programs and tests (i.e., flowcharts), rather than regular expressions. While the resulting version of PDL, call it APDL, is clearly equivalent in expressive power to PDL, it is also (in the worst case) exponentially more succinct. In particular, deciding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 1989
ISSN: 0890-5401
DOI: 10.1016/0890-5401(89)90033-3